Belnap's Epistemic States and Negation-as-Failure
نویسنده
چکیده
Generalizing Belnap's system of epistemic states [Bel77] we obtain the system of disjunctive factbases which is the paradigm for all other kinds of disjunctive knowledge bases. Disjunctive factbases capture the nonmonotonic reasoning based on paraminimal models. In the schema of a disjunctive factbase, certain predicates of the resp. domain are declared to be exact, i.e. two-valued, and in turn some of these exact predicates are declared to be subject to the Closed-World Assumption (CWA). Thus, we distinguish between three kinds of predicates: inexact predicates, exact predicates subject to the CWA, and exact predicates not subject to the CWA.
منابع مشابه
Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...
متن کاملCombining Explicit Negation and Negation by Failure Via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two diierent forms of reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and a...
متن کاملExpressiveness vs. Complexity in Nonmonotonic Knowledge Bases: Propositional Case
We study the trade-off between the expressive abilities and the complexity of reasoning in propositional nonmonotonic knowledge bases. We first analyze, in an expressive epistemic modal framework, the most popular forms of nonmonotonic mechanisms used in knowledge representation: in particular, we prove that epistemic queries and epistemic integrity constraints are naturally expressed through t...
متن کاملNegation in the Head of CP-logic Rules
CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both of these logics adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs. In other words, these logics lack the epistemic component of ASP, in which interpretations represent the beliefs or knowledge of a rational agent. Consequently, neither CP-logic nor FO(ID) have the ne...
متن کاملMinimal Belief and Negation as Failure: A Feasible Approach
Lifschitz introduced a logic of minimal belief and negation as failure, called MBNF, in order to provide a theory of epistemic queries to nonmonotonic databases. We present a feasible subsystem of MBNF which can be translated into a logic built on first order logic and negation as failure, called FONF. We give a semantics for FONF along with an extended connection calculus. In particular, we de...
متن کامل